منابع مشابه
Randomization Time for the Overhand Shuffle
1. THE OVERHAND SHUFFLE (~o The two most common methods of shuffling a deck of playing cards are the riffle shuffle and the overhand shuffle. The riffle shuffle is performed by splitting the deck into two halves and interlacing them. Aldous and Diaconis have shown in Ref. I that approximately 2 log N riffle shuffles suffices to randomize a deck (the meaning of this will be made more precise bel...
متن کاملConstrained Randomization of Time Series Data
A new method is introduced to create artificial time sequences that fulfil given constraints but are random otherwise. Constraints are usually derived from a measured signal for which surrogate data are to be generated. They are fulfilled by minimizing a suitable cost function using simulated annealing. A wide variety of structures can be imposed on the surrogate series, including multivariate,...
متن کاملRandomization in the First Hitting Time Problem∗
In this paper we consider the following inverse problem for the first hitting time distribution: given a Wiener process with a random initial state, probability distribution, F (t), and a linear boundary, b(t) = μt, find a distribution of the initial state such that the distribution of the first hitting time is F (t). This problem has important applications in credit risk modeling where the pro...
متن کاملRun-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tries to minimize the impact of a successful attack. Unfortunately, widespread adoption of this technique is hampered by its incompatibility with the current software distribution model, which requires identical physical ...
متن کاملA Randomization Technique for Non-Orthogonal Space-Time Block Codes
In this paper we propose a transmission concept that improves the performance of high rate non-orthogonal space-time block codes. Orthogonal space-time codes have well known rate limitations [9], [7]. If the symbol rate is increased beyond those limits either code orthogonality [5] or the effective diversity gain is necessarily compromised. In the presence of channel coding the performance of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Thoracic and Cardiovascular Surgery
سال: 2017
ISSN: 0022-5223
DOI: 10.1016/j.jtcvs.2017.03.069